Global linear complexity analysis of filter keystream generators
نویسندگان
چکیده
منابع مشابه
Global Linear Complexity Analysis of Filter Keystream Generators
An efficient algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. The technique here developed is based exclusively on the realization of bit wise logic operations, which makes it appropriate for both software simulation and hardware implementation. The present algorithm can be applied to any arbitrary nonlinear function with a ...
متن کاملComments on "a family of keystream generators with large linear complexity"
In thus work, a new class of keystream generators with a large hnear complexity has been derived The design crlterla are esslly compatible with those given m the hterature to prevent correlation attacks @ 2001 Elsevler Science Ltd All rights reserved Keywords-Cryptography, Information theory, Linear complexity, Pseudorandom sequence generators, Shift register
متن کاملImproved Linear Consistency Attack on Irregular Clocked Keystream Generators
In this paper we propose a new attack on a general model for irregular clocked keystream generators. The model consists of two feedback shift registers of lengths l1 and l2, where the first shift register produces a clock control sequence for the second. This model can be used to describe among others the shrinking generator, the step-1/step2 generator and the stop and go generator. We prove th...
متن کاملOn Fibonacci Keystream Generators
A number of keystream generators have been proposed which are based on Fibonacci sequences, and at least one has been elded. They are attractive in that they can use some of the security results from the theory of shift register based keystream generators, while running much more quickly in software. However, new designs bring new risks, and we show how a system proposed at last year's workshop...
متن کاملBDD-Based Cryptanalysis of Keystream Generators
Many of the keystream generators which are used in practice are LFSR-based in the sense that they produce the keystream according to a rule y = C(L(x)), where L(x) denotes an internal linear bitstream, produced by a small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. We present an n2 time bounded attack, the FBDD-attack, against L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEE Proceedings - Computers and Digital Techniques
سال: 1997
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:19970764